/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package cflp;

/**
 *
 * @author gbula
 */
public class BTMAIN {

    public static void main(String[] args) {
        String[] nombres = {"N50L2U2K25F10", "N50L4U2K25F10", "N100L2U2K25F10", "N100L4U2K25F10"};
        for (int i = 0; i < nombres.length; ++i) {
            String nombre = "problemas/" + nombres[i] + ".txt";
            Network n = new Network(nombre);
            System.out.println(nombres[i]);
            int[] ll = {7, 15};
            int[] cp = {50, 100};
            int[] eb = {1, 2};
            for (int l = 0; l < ll.length; ++l) {
                for (int c = 0; c < cp.length; ++c) {
                    for (int e = 0; e < eb.length; ++e) {
                        System.out.println(ll[l]+"\t"+cp[c]+"\t"+eb[e]);
                        for (int j = 1; j <= 5; ++j) {
                            System.out.println("Corrida " + j);
                            java.util.Date tInicio = new java.util.Date();
                            BusquedaTabu bt = new BusquedaTabu(ll[l],cp[c],eb[e], n);
                            java.util.Date tFinal = new java.util.Date();
                            System.out.println((tFinal.getTime() - tInicio.getTime()) / 1000d);
                        }
                    }
                }
            }
        }
    }
}
